High Dimensional Normality of Noisy Eigenvectors
نویسندگان
چکیده
We study joint eigenvector distributions for large symmetric matrices in the presence of weak noise. Our main result asserts that every submatrix orthogonal matrix eigenvectors converges to a multidimensional Gaussian distribution. The proof involves analyzing stochastic eigenstate equation (SEE) (Bourgade and Yau Comm Math Phys, 2013) which describes Lie group valued flow induced by Brownian motion. consider associated colored moment defining an SDE on particle configuration space. This extends first introduced Bourgade (Comm multicolor setting. However, it is no longer driven underlying Markov process space due lack positivity semigroup kernel. Nevertheless, we prove dynamics admit sufficient averaged decay contractive properties. allows us establish optimal time relaxation equilibrium asymptotic normality eigenvectors. Applications random theory include explicit computations general Wigner type sparse graph models when corresponding eigenvalues lie bulk spectrum, as well Lévy correspond small energy levels.
منابع مشابه
Asymptotic Normality of Posterior Distributions in High Dimensional Linear Models
We study consistency and asymptotic normality of posterior distributions of the regression coeecient in a linear model when the dimension of the parameter grows with the sample size. Under certain growth restrictions on the dimension (depending on the design matrix), we show that the posterior distributions concentrate in neighbourhoods of the true parameter and can be approximated by an approp...
متن کاملHigh Dimensional Structured Estimation with Noisy Designs
Structured estimation methods, such as LASSO, have received considerable attention in recent years and substantial progress has been made in extending such methods to general norms and non-Gaussian design matrices. In real world problems, however, covariates are usually corrupted with noise and there have been efforts to generalize structured estimation method for noisy covariate setting. In th...
متن کاملHigh Dimensional Expectation-Maximization Algorithm: Statistical Optimization and Asymptotic Normality
We provide a general theory of the expectation-maximization (EM) algorithm for inferring high dimensional latent variable models. In particular, we make two contributions: (i) For parameter estimation, we propose a novel high dimensional EM algorithm which naturally incorporates sparsity structure into parameter estimation. With an appropriate initialization, this algorithm converges at a geome...
متن کاملHigh Dimensional EM Algorithm: Statistical Optimization and Asymptotic Normality
We provide a general theory of the expectation-maximization (EM) algorithm for inferring high dimensional latent variable models. In particular, we make two contributions: (i) For parameter estimation, we propose a novel high dimensional EM algorithm which naturally incorporates sparsity structure into parameter estimation. With an appropriate initialization, this algorithm converges at a geome...
متن کاملSharp thresholds for high-dimensional and noisy recovery of sparsity
The problem of consistently estimating the sparsity pattern of a vector β∗ ∈ R based on observations contaminated by noise arises in various contexts, including subset selection in regression, structure estimation in graphical models, sparse approximation, and signal denoising. We analyze the behavior of l1-constrained quadratic programming (QP), also referred to as the Lasso, for recovering th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications in Mathematical Physics
سال: 2022
ISSN: ['0010-3616', '1432-0916']
DOI: https://doi.org/10.1007/s00220-022-04468-w